#include <iostream>

using namespace std;

void an(int (* a)[3], int m, int n);

int main(void)
{
	int a[3][3] = {1, 2, 3, 4, 5, 6, 7, 8, 9};

	an(a, 3, 3);

	return 0;
}

void an(int (* a)[3], int m, int n)
{
	int i, j, k;
	int max, min;
	for(i = 0; i < m; i ++)
	{
		for(j = 0; j < n; j ++)
		{
			max = a[i][j];
			min = a[i][j];
			for(k = 0; k < n; k ++)
			{
				if(a[i][k] > max)
					max = a[i][k];
			}	
			if(max == a[i][j])
			{
				for(k = 0; k < m; k ++)
				{
					if(a[k][j] < min)
						min = a[k][j];
				}
				if(a[i][j] == min)
					cout << "鞍点在a[" << i << "][" << j << "]" << endl;
			}
		}
	}
}
